Existence and Construction of Difference Families and Their Applications to Combinatorial Codes in Multiple-Access Communications

نویسندگان

  • Koji Momihara
  • Masakazu Jimbo
  • Junya Satoh
چکیده

My interest in combinatorics began six years ago when I was studying in the laboratory of Professor Sanpei Kageyama at Hiroshima University as an undergraduate student. I started my study for combinatorics with reading the famous book " Introduction to Combinatorial Theory " written by R.C. Bose and B. Manvel. After one and a half years, I decided to enter Nagoya University and join the laboratory of Professor Masakazu Jimbo in order to study more deeply. I was inspired not only by his expert knowledge for combinatorial designs and their applications but also by his personality. This thesis presents results from my four and a half years research on difference families and combinatorial codes at the This thesis consists of six chapters. In the first chapter, a general introduction to combina-torial design theory, particularly, difference families and their application to combinatorial codes, and a survey of current new results are given. The next four chapters contain the au-thor's results in [88, 89, 90, 91, 92]. These chapters provide various new results on difference families including several known results via purely combinatorial techniques, the theory of finite fields, and number theory. Some of these papers are written jointly with other mathematicians , who are Professor Masakazu Jimbo In the final chapter, some concluding remarks and open problems related to results in this thesis are provided. This thesis demands of a little preparatory knowledge in combinatorial design theory but most concepts are thoroughly defined in each chapter of this thesis or self-explanatory. I would like to express my deepest appreciation to my advisor Professor Masakazu Jimbo. He has supervised my study for five and a half years and his continuous encouragement, patience, and excellent guidance had led me to successfully complete this thesis. I am most grateful to his invitation me to the academic world. I would also like to thank Professor Sanpei Kageyama. He had introduced me to the field of combinatorics in my undergraduate course. I am grateful for his kind advices not only on my study but also on my private life. I am especially indebted to Professor Ryoh Fuji-Hara, Professor Mieko Yamada, and Professor Junya Satoh for helping me to study combinatorics, number theory, and their applications to communication theory. I would like to give special thanks to Professor Marco Buratti and i Dr. Anita Pasotti for their knowledge and fruitful discussions about difference families, the main topic …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novel Combinatorial Constructions of Optical Orthogonal Codes for Incoherent Optical CDMA Systems

Three novel classes of optical orthogonal codes (OOCs) based on combinatorial designs are proposed. They are applicable to both synchronous and asynchronous incoherent optical code-division multiple access (OCDMA) and compatible with spectral-amplitude-coding (SAC), fast frequency hopping, and time-spreading schemes. Simplicity of construction, larger codeword families, and larger flexibility i...

متن کامل

Constructions for optimal constant weight cyclically permutable codes and difference families

A cyclically permutable code is a binary code whose codewords are cyclically distinct and have full cyclic order. An important class of these codes are the constant weight cyclically permutable codes. In a code of this class all codewords have the same weight w. These codes have many applications, including in optical code-division multiple-access communication systems and in constructing proto...

متن کامل

Cyclotomic construction of strong external difference families in finite fields

Strong external difference family (SEDF) and its generalizations GSEDF, BGSEDF in a finite abelian group G are combinatorial designs raised by Paterson and Stinson [7] in 2016 and have applications in communication theory to construct optimal strong algebraic manipulation detection codes. In this paper we firstly present some general constructions of these combinatorial designs by using differe...

متن کامل

Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels

In this paper we introduce a parameterized generalization of the well known superimposed codes. We give algorithms for their construction and provide non-existential results. We apply our new combinatorial structures to the e5cient solution of new group testing problems and access coordination issues in multiple access channels. c © 2003 Elsevier B.V. All rights reserved.

متن کامل

A general construction of Reed-Solomon codes based on generalized discrete Fourier transform

In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes  enjoy nice algebraic properties just as the classic one.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009